On shortest three-edge-connected Steiner networks with Euclidean distance
نویسندگان
چکیده
منابع مشابه
Sufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملEuclidean Shortest Paths on Polyhedra in Three Dimensions
In this thesis we develop optimal-time algorithms for computing shortest paths on polyhedral surfaces in three dimensions. Specifically: • We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dimensions. Our algorithm, which settles a major problem that has been open for more...
متن کاملTwo-connected Steiner networks: structural properties
We consider the problem of constructing a minimum-length 2-connected network for a set of terminals in a graph where edge-weights satisfy the triangle inequality. As a special case of the problem, we have the Euclidean 2-connected Steiner network problem in which a set of points in the plane should be interconnected by a 2-connected network of minimum length. These problems have natural applica...
متن کاملAn Efficient Edge Server Selection in Content Delivery Network using Dijkstras Shortest Path Routing Algorithm with Euclidean Distance
The performance enhancement of the edge server in Content Delivery Network is the budding area of the research in the fields of modern Information Technology and Communication Engineering so that the web users or the cloud users across the network get faster service irrespective of any geographic locations during browsing over internet and at the same time downloading multimedia contents. As an...
متن کاملWeighted Connected Domination and Steiner Trees in Distance-Hereditary Graphs
Distance-hereditary graphs are graphs in which every two vertices have the same distance in every connected induced subgraph containing them. This paper studies distance-hereditary graphs from an algorithmic viewpoint. In particular, we present linear-time algorithms for finding a minimum weighted connected dominating set and a minimum vertex-weighted Steiner tree in a distance-hereditary graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2000
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(99)00222-x